Halifax, Nova Scotia - PDFSEARCH.IO - Document Search Engine

Halifax, Nova Scotia
Results: 3693

#	Item
201	CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 The Gaussian Centre of a Set of Mobile Points Extended Abstract Steph Durocher∗ and David Kirkpatrick† Add to Reading List Source URL: www.cccg.ca Language: English Geometry Minimum bounding box
202	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Packing Plane Spanning Trees and Paths in Complete Geometric Graphs∗ Oswin Aichholzer† Thomas Hackl† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-06-20 19:34:00 Spanning tree Matroid theory Tree Planar graph Graph Geometric graph theory Matching Minimum spanning tree Petersen graph Graph theory Mathematics Theoretical computer science
203	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Planar Graphs with Many Perfect Matchings and Forests∗ Michael Biro† Abstract Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-07-29 21:46:24 Matching Line graph Graph coloring Tree Graph Path Edge coloring Apollonian network Graph theory Planar graphs Combinatorial optimization
204	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 On the Use of Adaptive, Exact Decisions Number Types Based on Expression-Dags in Geometric Computing Stefan Schirra∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-07-30 19:24:46 Max Planck Institute for Computer Science Data types Arithmetic Numerical analysis CGAL Floating point Directed acyclic graph Arbitrary-precision arithmetic Algorithm Mathematics Mathematical analysis Computer arithmetic
205	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 A Separator Theorem for Intersecting Objects in the Plane Nabil H. Mustafa∗ Rajiv Raman† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-06-20 06:34:30 Mathematics Planar graph Intersection graph Trapezoid
206	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 On the Computational Complexity of Partitioning Weighted Points into a Grid of Quadrilaterals Alexander Idelberger∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-07-27 21:29:04 Auxiliary function NP-complete problems Mathematics Forcing 8J
207	CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 Computing Delaunay Triangulation with Imprecise Input Data A. A. Khanban Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-01-08 18:44:34 Computational geometry Delaunay triangulation Voronoi diagram Sweep line algorithm Convex hull Circumscribed circle Pitteway triangulation Bowyer–Watson algorithm Geometry Triangulation Mathematics
208	CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 Hinged Dissection of Polygons is Hard Robert A. Hearn∗ Erik D. Demaine† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-01-08 18:44:35 Recreational mathematics Polyform Rectangle Area Polyomino Polygon Triangle Geometry Euclidean geometry Euclidean plane geometry
209	2015 CHHA NATIONAL CONFERENCE Halifax, Nova Scotia Projected Schedule Subject to updates on an ongoing basis THURSDAY, MAY 21, 2015 Add to Reading List Source URL: chha.ca Language: English - Date: 2015-04-17 11:19:31
210	CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 Shortest Paths in Two Intersecting Pencils of Lines David Hart∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-01-08 18:44:36 Quadrilaterals Network theory Arrangement of lines Shortest path problem Trigonometric functions Mathematics Geometry Euclidean plane geometry

UPDATE